Sports League Scheduling: Enumerative Search for Prob026 from CSPLib
نویسندگان
چکیده
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the best known constraint programing algorithm is limited to T ≤ 40. The proposed approach relies on interesting properties which are used to constraint the search process.
منابع مشابه
A note on a sports league scheduling problem
Sports league scheduling is a difficult task in the general case. In this short note, we report two improvements to an existing enumerative search algorithm for a NP-hard sports league scheduling problem known as “prob026” in CSPLib. These improvements are based on additional rules to constraint and accelerate the enumeration process. The proposed approach is able to find a solution (schedule) ...
متن کاملUsing solution properties within an enumerative search to solve a sports league scheduling problem
This paper presents an enumerative approach for a particular sports league scheduling problem known as “Prob026” in CSPLib. Despite its exponential-time complexity, this simple method can solve all instances involving a number T of teams up to 50 in a reasonable amount of time while the best known tabu search and constraint programming algorithms are limited to T ≤ 40 and the direct constructio...
متن کاملScheduling the Finnish 1st Division Ice Hockey League
Generating a schedule for a professional sports league is an extremely demanding task. Good schedules have many benefits for the league, for example higher incomes, lower costs and more interesting and fairer seasons. This paper presents a successful solution method to schedule the Finnish 1st division ice hockey league. The solution method is an improved version of the method used to schedule ...
متن کاملSolving the Sports League Scheduling Problem with Tabu Search
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisfaction Problem (CSP). Tests were carried out on problem instances of up to 40 teams representing 780 integer variables with 780 values per variable. Experimental results show that this approach outperforms some existi...
متن کاملThe Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling
With the recent inclusion of inter-league games to professional sports leagues, a natural question is to determine the “best possible” inter-league schedule that retains all of the league’s scheduling constraints to ensure competitive balance and fairness, while minimizing the total travel distance for both economic and environmental efficiency. To answer that question, this paper introduces th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006